Back to course home
0% completed
Vote For New Content
Oracle Hard
Integer to English Words (hard)
Solution: Integer to English Words
Trapping Rain Water (hard)
Solution: Trapping Rain Water
First Missing Positive (hard)
Solution: First Missing Positive
Merge K Sorted Lists (hard)
Solution: Merge K Sorted Lists
Max Points on a Line (hard)
Solution: Max Points on a Line
Sudoku Solver (hard)
Solution: Sudoku Solver
Longest Valid Parentheses (hard)
Solution: Longest Valid Parentheses
Remove Nth Node From End of List (Medium)
Solution: Remove Nth Node From End of List
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Constrained Subsequence Sum (hard)
Solution: Constrained Subsequence Sum
Decode String (Medium)
Problem Statement
You have a string that represents encodings of substrings, where each encoding is of the form k[encoded_string], where k is a positive integer, and encoded_string is a string that contains letters only.
Your task is to decode this string by repeating the encoded_string k times and return it. It is given that k is always a positive integer.
Examples
-
- Input:
"3[a3[c]]" - Expected Output:
"acccacccaccc" - Justification: The inner
3[c]is decoded asccc, and thenais appended to the front, formingacc. This is then repeated 3 times to formacccacccaccc.
- Input:
-
- Input:
"2[b3[d]]" - Expected Output:
"bdddbddd" - Justification: The inner
3[d]is decoded asddd, and thenbis appended to the front, formingbddd. This is then repeated 2 times to formbddd bddd.
- Input:
-
- Input:
"4[z]" - Expected Output:
"zzzz" - Justification: The
4[z]is decoded aszrepeated 4 times, formingzzzz.
- Input:
Constraints:
1 <= s.length <= 30sconsists of lowercase English letters, digits, and square brackets '[]'.sis guaranteed to be a valid input.- All the integers in s are in the range
[1, 300].
Try it yourself
Try solving this question here:
Java
. . . .
Solution: Group Anagrams
Solution: Decode String
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself